A Polynomial-time Affine-scaling Method for Semidefinite and Hyperbolic Programming
نویسندگان
چکیده
We develop a natural variant of Dikin’s affine-scaling method, first for semidefinite programming and then for hyperbolic programming in general. We match the best complexity bounds known for interior-point methods. All previous polynomial-time affine-scaling algorithms have been for conic optimization problems in which the underlying cone is symmetric. Hyperbolicity cones, however, need not be symmetric. Our algorithm is the first polynomial-time affine-scaling method not relying on symmetry.
منابع مشابه
Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming
Two primal{dual a ne scaling algorithms for linear programming are extended to semide nite programming. The algorithms do not require (nearly) centered starting solutions, and can be initiated with any primal{dual feasible solution. The rst algorithm is the Dikin-type a ne scaling method of Jansen et al. [8] and the second the pure a ne scaling method of Monteiro et al. [12]. The extension of t...
متن کاملA polynomial primal-dual affine scaling algorithm for symmetric conic optimization
The primal-dual Dikin-type affine scaling method was originally proposed for linear optimization and then extended to semidefinite optimization. Here, the method is generalized to symmetric conic optimization using the notion of Euclidean Jordan algebras. The method starts with an interior feasible but not necessarily centered primal-dual solution, and it features both centering and reducing th...
متن کاملPrimal-Dual Path-Following Algorithms for Semidefinite Programming
This paper deals with a class of primal-dual interior-point algorithms for semideenite programming (SDP) which was recently introduced by Kojima, Shindoh and Hara 11]. These authors proposed a family of primal-dual search directions that generalizes the one used in algorithms for linear programming based on the scaling matrix X 1=2 S ?1=2. They study three primal-dual algorithms based on this f...
متن کاملPolynomial Primal Dual Cone Affine Scaling for Semidefinite Programming
Semide nite programming concerns the problem of optimizing a linear function over a section of the cone of semide nite matrices In the cone a ne scaling approach we replace the cone of semide nite matrices by a certain inscribed cone in such a way that the resulting optimization problem is analytically solvable The now easily obtained solution to this modi ed problem serves as an approximate so...
متن کاملPrimal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming
In this paper, we give an example of a semidefinite programming problem in which primal-dual affine-scaling algorithms using the HRVW/KSH/M, MT, and AHO directions fail. We prove that each of these algorithm can generate a sequence converging to a non-optimal solution, and that, for the AHO direction, even its associated continuous trajectory can converge to a non-optimal point. In contrast wit...
متن کامل